3 research outputs found
An Analytical Model-based Capacity Planning Approach for Building CSD-based Storage Systems
The data movement in large-scale computing facilities (from compute nodes to
data nodes) is categorized as one of the major contributors to high cost and
energy utilization. To tackle it, in-storage processing (ISP) within storage
devices, such as Solid-State Drives (SSDs), has been explored actively. The
introduction of computational storage drives (CSDs) enabled ISP within the same
form factor as regular SSDs and made it easy to replace SSDs within traditional
compute nodes. With CSDs, host systems can offload various operations such as
search, filter, and count. However, commercialized CSDs have different hardware
resources and performance characteristics. Thus, it requires careful
consideration of hardware, performance, and workload characteristics for
building a CSD-based storage system within a compute node. Therefore, storage
architects are hesitant to build a storage system based on CSDs as there are no
tools to determine the benefits of CSD-based compute nodes to meet the
performance requirements compared to traditional nodes based on SSDs. In this
work, we proposed an analytical model-based storage capacity planner called
CSDPlan for system architects to build performance-effective CSD-based compute
nodes. Our model takes into account the performance characteristics of the host
system, targeted workloads, and hardware and performance characteristics of
CSDs to be deployed and provides optimal configuration based on the number of
CSDs for a compute node. Furthermore, CSDPlan estimates and reduces the total
cost of ownership (TCO) for building a CSD-based compute node. To evaluate the
efficacy of CSDPlan, we selected two commercially available CSDs and 4
representative big data analysis workloads
Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases
Recently, several researches have been performed for updating XML documents[1][2][12] stored in databases. These researches define update operations and resolve some semantic problems. However, because the update operations are usually validated after execution, conflicts can occur among them. Furthermore, in many studies for updating, they just validate whole XML documents and can t validate parts of them. If updates are very frequent, validation will cause performance degradation. In this paper, we propose immediate and partial validation mechanism for these two problems